Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
نویسندگان
چکیده
We give a linear-time algorithm to decide 3-colorability of triangle-free graph embedded in fixed surface, and quadratic-time output 3-coloring the affirmative case. The algorithms also allow prescribe coloring bounded number vertices.
منابع مشابه
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
We give a linear-time algorithm to decide 3-colorability of a trianglefree graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring for a bounded number of vertices.
متن کاملThree-coloring triangle-free graphs on surfaces
Let G be a 4-critical graph with t triangles, embedded in a surface of genus g. Let c be the number of 4-cycles in G that do not bound a 2-cell face. We prove that X f face of G (|f | − 4) ≤ κ(g + t+ c− 1) for a fixed constant κ, thus generalizing and strengthening several known results. As a corollary, we prove that every triangle-free graph G embedded in a surface of genus g contains a set of...
متن کاملColoring triangle-free graphs on surfaces
Let S be a fixed surface, and let k and q be fixed integers. Is there a polynomial-time algorithm that decides whether an input graph of girth at least q drawn in S is k-colorable? This question has been studied extensively during the last 15 years. In the first part of the talk we will survey known results. In the second part of the talk we describe a solution to one of the two cases left open...
متن کاملColoring triangle - free graphs on surfaces . Extended
Gimbel and Thomassen asked whether 3-colorability of a triangle-free graph drawn on a fixed surface can be tested in polynomial time. We settle the question by giving a linear-time algorithm for every surface which combined with previous results gives a lineartime algorithm to compute the chromatic number of such graphs. Our algorithm is based on a structure theorem that for a triangle-free gra...
متن کاملThree-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies∗
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable. In fact, we prove a more general theorem. Let G be a planar graph, and let H be a set of connected subgraphs of G, each of bounded size, such that every two distinct members of H are at least a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.07.002